A useful pyramid scheme

A Version Numbering Scheme with a Useful Lexicographical Order

We describe a numbering scheme for versions with alternatives that has a useful lexicographical ordering. The version hierarchy is a tree. By inspection of the version numbers, we can easily determine whether one version is an ancestor of another. If so, we can determine the version sequence between these two versions. If not, we can determine the most recent common ancestor to these two versio...

The Pyramid Scheme: Oblivious RAM for Trusted Processors

Modern processors, e.g., Intel SGX, allow applications to isolate secret code and data in encrypted memory regions called enclaves. While encryption effectively hides the contents of memory, the sequence of address references issued by the secret code leaks information. This is a serious problem because these leaks can easily break the confidentiality guarantees of enclaves. In this paper, we e...

The counting pyramid: an adaptive distributed counting scheme

A distributed counter is a concurrent object which provides a fetch-and-increment operation on a shared value. On the basis of a distributed counter, one can implement various fundamental data structures, such as queues or stacks. We present the counting pyramid, an efficient implementation of a distributed counter in a message passing system, which is based on software combining. The counting ...

How Is a Vector Pyramid Scheme Aaected by Perturbation in the Mask?

When implementing a pyramid scheme on a computer, it is not possible to use the exact values of the terms of the reenement mask if some are irrational. The irrational terms must be perturbed. When this is the case, it is important to know that the pyramid scheme associated with the perturbed mask converges and that the limit function is close to the solution of the original reenement equation. ...

A Novel Entropy-Constrained Adaptive Quantization Scheme for Wavelet Pyramid Imagy Coding